Shortest Paths in Euclidean Graphs (Extended Abstract)
نویسندگان
چکیده
We analyze a simple method for finding shortest paths in Euclidean graphs (where vertices are points in a Euclidean space and edge weights are distances between points). For many graph models, the running time of the algorithm to find the shortest path between a specified pair of vertices in a graph with V vertices and E edges is shown to be O ( V ) as compared with O(V1ogV + E ) required by the classical (Dijkstra) algorithm.
منابع مشابه
Euclidean Shortest Path Problem with Rectilinear Obstacles1
This paper presents new heuristic algorithms using the guided A* search method : Guided Minimum Detour (GMD) algorithm and Line-by-Line Guided Minimum Detour (LGMD) algorithm for finding optimal rectilinear (L,) shortest paths in the presence of rectilinear obstacles. The GMD algorithm runs O(nhr(1ogN) + tN) in time and takes O(N) in space, where N is the number of extended line segments includ...
متن کاملApproximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in which distances between vertices in G are at most t times the Euclidean distances between them; in other words, distances in G are “stretched” by a factor of at most t. We consider the interesting dual problem: given a Eu...
متن کاملAn External Memory Data Structure for Shortest Path Queries ( Extended Abstract ) ⋆
We present results related to satisfying shortest path queries on a planar graph stored in external memory. In particular, we show how to store rooted trees in external memory so that bottom-up paths can be traversed I/O-efficiently, and we present I/O-efficient algorithms for triangulating planar graphs and computing small separators of such graphs. Using these techniques, we can construct a d...
متن کاملEfficient Shortest Paths on Massive Social Graphs (Invited Paper)
Analysis of large networks is a critical component of many of today’s application environments, including online social networks, protein interactions in biological networks, and Internet traffic analysis. The arrival of massive network graphs with hundreds of millions of nodes, e.g. social graphs, presents a unique challenge to graph analysis applications. Most of these applications rely on co...
متن کاملFully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract)
We consider the problem of maintaining the distances and the shortest paths from a single source in either a directed or an undirected graph with positive real edge weights, handling insertions, deletions and cost updates of edges. We propose fully dynamic algorithms with optimal space requirements and query time. The cost of update operations depends on the class of the considered graph and on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1984